منابع مشابه
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construction process exists. In one form of our technique, no explicit isomorphism testing is required. In the other form, isomorph testing is restricted to within small subsets of the entire set of objects. A variety of differ...
متن کاملOn the exhaustive generation of convex permutominoes
A permutomino of size n is a polyomino determined by a pair (π1, π2) of permutations of size n + 1, such that π1(i) 6= π2(i), for 1 ≤ i ≤ n+ 1. In this paper, after recalling some enumerative results about permutominoes, we give a first algorithm for the exhaustive generation of a particular class of permutominoes, the convex permutominoes, proving that its cost is proportional to the number of...
متن کاملEquivalence-free exhaustive generation of matroid representations
In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite (partial) field, and which contain a given minor. The nature of this problem is exponential, and it appears to be much harder than, say, isomorph-free generation of graphs. Still, our algorithm is very suitable for practical u...
متن کاملOn the exhaustive generation of plane partitions
We present a CAT (Constant Amortized Time) algorithm for generating all plane partitions of an integer n, that is, all integer matrices with non-increasing rows and columns having sum n. © 2012 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.02.032